On the system optimum of traffic assignment in M/G/c/c state-dependent queueing networks

نویسندگان

  • Frederico R. B. Cruz
  • Tom Van Woensel
  • James MacGregor Smith
  • Kris Lieckens
چکیده

The classical Wardrop System Optimum assignment model assumes that the users will cooperate with each other in order to minimize the overall travel costs. The importance of the System Optimum model lies on its wellrecognized ability of producing solutions that correspond to the most efficient way of using the scarce resources represented by the street and road capacities. In this paper, we present a version of the System Optimum model in which the travel costs incurred on each path come from M/G/c/c state-dependent queueing networks, a stochastic travel time estimation formula which takes into account congestion effects. A differential evolution algorithm is proposed to solve the model. We motivate this version of the problem in several ways and computational results show that the proposed approach is efficient.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of M/G/ 1 queueing model with state dependent arrival and vacation

This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...

متن کامل

Transient Analysis of M/M/R Machining System with Mixed Standbys, Switching Failures, Balking, Reneging and Additional Removable Repairmen

The objective of this paper is to study the M/M/R machine repair queueing system with mixed standbys. The life-time and repair time of units are assumed to be exponentially distributed. Failed units are repaired on FCFS basis. The standbys have switching failure probability q (0≤q≤1). The repair facility of the system consists of R permanent as well as r additional removable repairmen. Due to i...

متن کامل

Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows

| One of the most notorious network design problems is the Quadratic Assignment Problem (QAP). We develop an heuristic algorithm for QAPs along with an M/G/C/C state dependent queueing model for capturing congestion in the tra c system interconnecting the nodes in the network. Computational results are also presented.

متن کامل

M/G/c/c state dependent queuing model for a road traffic system of two sections in tandem

We propose in this article a M/G/c/c state dependent queuing model for road traffic flow. The model is based on finite capacity queuing theory which captures the stationary density-flow relationships. It is also inspired from the deterministic Godunov scheme for the road traffic simulation. We first present a reformulation of the existing linear case of M/G/c/c state dependent model, in order t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 201  شماره 

صفحات  -

تاریخ انتشار 2010